0.03/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.13 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM 0.13/0.34 % Computer : n004.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 1920 0.13/0.34 % WCLimit : 240 0.13/0.34 % DateTime : Wed Jul 30 03:07:34 EDT 2025 0.13/0.34 % CPUTime : 0.20/0.49 Running higher-order theorem proving 0.20/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.t37hY4bCue/E---3.1_22244.p 24.29/3.57 # Version: 3.0.0-ho 24.29/3.57 # Preprocessing class: HSMSSMSSSSSNHHA. 24.29/3.57 # Scheduled 6 strats onto 8 cores with 240 seconds (1920 total) 24.29/3.57 # Starting full_lambda_6 with 720s (3) cores 24.29/3.57 # Starting post_as_ho1 with 240s (1) cores 24.29/3.57 # Starting lpo6_lambda_fix with 240s (1) cores 24.29/3.57 # Starting ho_unfolding_1 with 240s (1) cores 24.29/3.57 # Starting new_ho_10_unif with 240s (1) cores 24.29/3.57 # Starting ho_unfolding_2 with 240s (1) cores 24.29/3.57 # full_lambda_6 with pid 22327 completed with status 0 24.29/3.57 # Result found by full_lambda_6 24.29/3.57 # Preprocessing class: HSMSSMSSSSSNHHA. 24.29/3.57 # Scheduled 6 strats onto 8 cores with 240 seconds (1920 total) 24.29/3.57 # Starting full_lambda_6 with 720s (3) cores 24.29/3.57 # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true) 24.29/3.57 # Search class: HGHNF-FFSF22-SHHFFSBN 24.29/3.57 # Scheduled 6 strats onto 3 cores with 720 seconds (720 total) 24.29/3.57 # Starting new_ho_10_unif with 216s (1) cores 24.29/3.57 # Starting full_lambda_6 with 73s (1) cores 24.29/3.57 # Starting sh5l with 109s (1) cores 24.29/3.57 # new_ho_10_unif with pid 22333 completed with status 0 24.29/3.57 # Result found by new_ho_10_unif 24.29/3.57 # Preprocessing class: HSMSSMSSSSSNHHA. 24.29/3.57 # Scheduled 6 strats onto 8 cores with 240 seconds (1920 total) 24.29/3.57 # Starting full_lambda_6 with 720s (3) cores 24.29/3.57 # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true) 24.29/3.57 # Search class: HGHNF-FFSF22-SHHFFSBN 24.29/3.57 # Scheduled 6 strats onto 3 cores with 720 seconds (720 total) 24.29/3.57 # Starting new_ho_10_unif with 216s (1) cores 24.29/3.57 # Preprocessing time : 0.001 s 24.29/3.57 # Presaturation interreduction done 24.29/3.57 24.29/3.57 # Proof found! 24.29/3.57 # SZS status Theorem 24.29/3.57 # SZS output start CNFRefutation 24.29/3.57 thf(decl_sort1, type, a: $tType). 24.29/3.57 thf(decl_23, type, epred1_0: a > a > $o). 24.29/3.57 thf(decl_24, type, esk1_0: (a > $o) > a). 24.29/3.57 thf(decl_25, type, esk2_2: (a > $o) > a > a). 24.29/3.57 thf(decl_26, type, esk3_0: a > a). 24.29/3.57 thf(cTHM145_B_pme, conjecture, ![X1:a > a > $o, X2:(a > $o) > a]:((![X3:a > a]:((?[X4:a]:(((X1 @ (X3 @ X4) @ X4)&(X1 @ X4 @ (X3 @ X4))))<=(![X5:a, X6:a]:(((X1 @ X5 @ X6)=>(X1 @ (X3 @ X5) @ (X3 @ X6))))&![X5:a, X6:a]:(((X1 @ X5 @ X6)=>(X1 @ (X3 @ X5) @ (X3 @ X6)))))))<=(![X5:a, X6:a, X7:a]:(((X1 @ X5 @ X7)<=((X1 @ X5 @ X6)&(X1 @ X6 @ X7))))&![X8:a > $o]:(((![X7:a]:(((X8 @ X7)=>(X1 @ X7 @ (X2 @ X8))))&![X9:a]:(((X1 @ (X2 @ X8) @ X9)<=![X10:a]:(((X1 @ X10 @ X9)<=(X8 @ X10))))))&![X7:a]:(((X1 @ X7 @ (X2 @ X8))<=(X8 @ X7)))))))), file('/export/starexec/sandbox2/tmp/tmp.t37hY4bCue/E---3.1_22244.p', cTHM145_B_pme)). 24.29/3.57 thf(c_0_1, negated_conjecture, ~(![X1:a > a > $o, X2:(a > $o) > a]:(((![X5:a, X6:a, X7:a]:((((X1 @ X5 @ X6)&(X1 @ X6 @ X7))=>(X1 @ X5 @ X7)))&![X8:a > $o]:(((![X7:a]:(((X8 @ X7)=>(X1 @ X7 @ (X2 @ X8))))&![X9:a]:((![X10:a]:(((X8 @ X10)=>(X1 @ X10 @ X9)))=>(X1 @ (X2 @ X8) @ X9))))&![X7:a]:(((X8 @ X7)=>(X1 @ X7 @ (X2 @ X8)))))))=>![X3:a > a]:((![X5:a, X6:a]:(((X1 @ X5 @ X6)=>(X1 @ (X3 @ X5) @ (X3 @ X6))))=>?[X4:a]:(((X1 @ (X3 @ X4) @ X4)&(X1 @ X4 @ (X3 @ X4))))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM145_B_pme])])). 24.29/3.57 thf(c_0_2, negated_conjecture, ![X29:a, X30:a, X31:a, X32:a > $o, X33:a, X34:a, X36:a, X38:a, X39:a, X40:a]:((((~(epred1_0 @ X29 @ X30)|~(epred1_0 @ X30 @ X31)|(epred1_0 @ X29 @ X31))&(((~(X32 @ X33)|(epred1_0 @ X33 @ (esk1_0 @ X32)))&(((X32 @ (esk2_2 @ X32 @ X34))|(epred1_0 @ (esk1_0 @ X32) @ X34))&(~(epred1_0 @ (esk2_2 @ X32 @ X34) @ X34)|(epred1_0 @ (esk1_0 @ X32) @ X34))))&(~(X32 @ X36)|(epred1_0 @ X36 @ (esk1_0 @ X32)))))&((~(epred1_0 @ X38 @ X39)|(epred1_0 @ (esk3_0 @ X38) @ (esk3_0 @ X39)))&(~(epred1_0 @ (esk3_0 @ X40) @ X40)|~(epred1_0 @ X40 @ (esk3_0 @ X40)))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])). 24.29/3.57 thf(c_0_3, negated_conjecture, ![X4:a, X5:a, X6:a]:(((epred1_0 @ X4 @ X6)|~((epred1_0 @ X4 @ X5))|~((epred1_0 @ X5 @ X6)))), inference(split_conjunct,[status(thm)],[c_0_2])). 24.29/3.57 thf(c_0_4, negated_conjecture, ![X4:a, X5:a]:(((epred1_0 @ (esk3_0 @ X4) @ (esk3_0 @ X5))|~((epred1_0 @ X4 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_2])). 24.29/3.57 thf(c_0_5, negated_conjecture, ![X4:a, X6:a, X5:a]:(((epred1_0 @ X4 @ (esk3_0 @ X5))|~((epred1_0 @ X4 @ (esk3_0 @ X6)))|~((epred1_0 @ X6 @ X5)))), inference(spm,[status(thm)],[c_0_3, c_0_4])). 24.29/3.57 thf(c_0_6, negated_conjecture, ![X8:a > $o, X4:a]:(((X8 @ (esk2_2 @ X8 @ X4))|(epred1_0 @ (esk1_0 @ X8) @ X4))), inference(split_conjunct,[status(thm)],[c_0_2])). 24.29/3.57 thf(c_0_7, negated_conjecture, ![X8:a > $o, X4:a]:(((epred1_0 @ X4 @ (esk1_0 @ X8))|~((X8 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 24.29/3.57 thf(c_0_8, negated_conjecture, ![X3:a > a, X4:a, X13:a > a, X5:a]:(((epred1_0 @ (X3 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X3 @ Z0) @ (esk3_0 @ (X13 @ Z0))))) @ X4)) @ (esk3_0 @ X5))|(epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X3 @ Z0) @ (esk3_0 @ (X13 @ Z0)))))) @ X4)|~((epred1_0 @ (X13 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X3 @ Z0) @ (esk3_0 @ (X13 @ Z0))))) @ X4)) @ X5)))), inference(spm,[status(thm)],[c_0_5, c_0_6])). 24.29/3.57 thf(c_0_9, negated_conjecture, ![X1:a > a > $o, X4:a]:(((epred1_0 @ (esk2_2 @ (^[Z0/* 3 */:a]:((X1 @ Z0 @ Z0))) @ X4) @ (esk1_0 @ (^[Z0/* 3 */:a]:((X1 @ Z0 @ Z0)))))|(epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((X1 @ Z0 @ Z0)))) @ X4))), inference(spm,[status(thm)],[c_0_7, c_0_6])). 24.29/3.57 thf(c_0_10, negated_conjecture, ![X8:a > $o, X4:a]:(((epred1_0 @ (esk1_0 @ X8) @ X4)|~((epred1_0 @ (esk2_2 @ X8 @ X4) @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 24.29/3.57 thf(c_0_11, negated_conjecture, ![X4:a]:(((epred1_0 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))) @ X4) @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))))|(epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))) @ X4))), inference(spm,[status(thm)],[c_0_8, c_0_9])). 24.29/3.57 thf(c_0_12, negated_conjecture, ![X3:a > a, X4:a]:(((epred1_0 @ (esk3_0 @ X4) @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ (X3 @ Z0)))))))|~((epred1_0 @ X4 @ (X3 @ (esk3_0 @ X4)))))), inference(spm,[status(thm)],[c_0_7, c_0_4])). 24.29/3.57 thf(c_0_13, negated_conjecture, (epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))) @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))))), inference(spm,[status(thm)],[c_0_10, c_0_11])). 24.29/3.57 thf(c_0_14, negated_conjecture, ![X4:a]:((~((epred1_0 @ (esk3_0 @ X4) @ X4))|~((epred1_0 @ X4 @ (esk3_0 @ X4))))), inference(split_conjunct,[status(thm)],[c_0_2])). 24.29/3.57 thf(c_0_15, negated_conjecture, (epred1_0 @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))) @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))), inference(spm,[status(thm)],[c_0_12, c_0_13])). 24.29/3.57 thf(c_0_16, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_13])]), ['proof']). 24.29/3.57 # SZS output end CNFRefutation 24.29/3.57 # Parsed axioms : 2 24.29/3.57 # Removed by relevancy pruning/SinE : 1 24.29/3.57 # Initial clauses : 7 24.29/3.57 # Removed in clause preprocessing : 0 24.29/3.57 # Initial clauses in saturation : 7 24.29/3.57 # Processed clauses : 769 24.29/3.57 # ...of these trivial : 118 24.29/3.57 # ...subsumed : 235 24.29/3.57 # ...remaining for further processing : 416 24.29/3.57 # Other redundant clauses eliminated : 0 24.29/3.57 # Clauses deleted for lack of memory : 0 24.29/3.57 # Backward-subsumed : 29 24.29/3.57 # Backward-rewritten : 39 24.29/3.57 # Generated clauses : 39506 24.29/3.57 # ...of the previous two non-redundant : 33989 24.29/3.57 # ...aggressively subsumed : 0 24.29/3.57 # Contextual simplify-reflections : 0 24.29/3.57 # Paramodulations : 39344 24.29/3.57 # Factorizations : 161 24.29/3.57 # NegExts : 0 24.29/3.57 # Equation resolutions : 1 24.29/3.57 # Disequality decompositions : 0 24.29/3.57 # Total rewrite steps : 5885 24.29/3.57 # ...of those cached : 5134 24.29/3.57 # Propositional unsat checks : 0 24.29/3.57 # Propositional check models : 0 24.29/3.57 # Propositional check unsatisfiable : 0 24.29/3.57 # Propositional clauses : 0 24.29/3.57 # Propositional clauses after purity: 0 24.29/3.57 # Propositional unsat core size : 0 24.29/3.57 # Propositional preprocessing time : 0.000 24.29/3.57 # Propositional encoding time : 0.000 24.29/3.57 # Propositional solver time : 0.000 24.29/3.57 # Success case prop preproc time : 0.000 24.29/3.57 # Success case prop encoding time : 0.000 24.29/3.57 # Success case prop solver time : 0.000 24.29/3.57 # Current number of processed clauses : 342 24.29/3.57 # Positive orientable unit clauses : 82 24.29/3.57 # Positive unorientable unit clauses: 0 24.29/3.57 # Negative unit clauses : 14 24.29/3.57 # Non-unit-clauses : 246 24.29/3.57 # Current number of unprocessed clauses: 32778 24.29/3.57 # ...number of literals in the above : 100999 24.29/3.57 # Current number of archived formulas : 0 24.29/3.57 # Current number of archived clauses : 74 24.29/3.57 # Clause-clause subsumption calls (NU) : 10347 24.29/3.57 # Rec. Clause-clause subsumption calls : 8762 24.29/3.57 # Non-unit clause-clause subsumptions : 258 24.29/3.57 # Unit Clause-clause subsumption calls : 2249 24.29/3.57 # Rewrite failures with RHS unbound : 0 24.29/3.57 # BW rewrite match attempts : 1688 24.29/3.57 # BW rewrite match successes : 48 24.29/3.57 # Condensation attempts : 769 24.29/3.57 # Condensation successes : 9 24.29/3.57 # Termbank termtop insertions : 10203470 24.29/3.57 # Search garbage collected termcells : 436 24.29/3.57 24.29/3.57 # ------------------------------------------------- 24.29/3.57 # User time : 2.871 s 24.29/3.57 # System time : 0.110 s 24.29/3.57 # Total time : 2.981 s 24.29/3.57 # Maximum resident set size: 1868 pages 24.29/3.57 24.29/3.57 # ------------------------------------------------- 24.29/3.57 # User time : 8.713 s 24.29/3.57 # System time : 0.243 s 24.29/3.57 # Total time : 8.956 s 24.29/3.57 # Maximum resident set size: 1736 pages 24.29/3.57 % E exiting 24.29/3.57 % E exiting 24.29/3.57 EOF